Note: Online Searching / on the Optimality of the Geometric Sequences for themRay Search Online Searching
نویسندگان
چکیده
منابع مشابه
Designing and Validating a Search Questionnaire for Searching in Online Information Resources Based on Clinical Questions Among Iranian Medical Students
Objective To be up-to-date, the medical community must have the ability to communicate in the electronic environment and search for information resources. The present study aims to develop a questionnaire to assess the attitudes of Iranian medical students towards searching for information resources by formulating clinical questions and evaluate its validly and reliability. Methods This is a d...
متن کاملOnline Searching
We consider the problem of searching m branches which, with the exception of a common source s, are disjoint (hereafter called concurrent branches). A searcher, starting at s, must find a given “exit” t whose location, unknown to the searcher, is on one of the m branches. The problem is to find a strategy that minimizes the worst case ratio between the total distance traveled and the length of ...
متن کاملsubject searching in online cataloging systems
in online catalogs, searching based on subject keywords, comprise a significant percentage of searches. various studies, especially those of us origin, have stated it to be more than 50 percent. due to the importance of subject searching in online cataloging systems for users, much efforts is being exerted on the part of researchers and designers of such cataloging systems to increase its perfo...
متن کاملChallenges in Searching Online Communities
An ever-growing number of users participate in online communities such as Flickr, del.icio.us , and YouTube , making friends and sharing content. Users come to these sites to find out about general trends – the most popular tags, or the most recently tagged item – as well as for more specific information, such as the recent posts of one of their friends. While these activities correspond to dif...
متن کاملOnline searching with turn cost
We consider the problem of searching for an object on a line at an unknown distance OPT from the original position of the searcher, in the presence of a cost of d for each time the searcher changes direction. This is a generalization of the well-studied linear-search problem. We describe a strategy that is guaranteed to find the object at a cost of at most 9 · OPT + 2d, which has the optimal co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 2002
ISSN: 0030-364X,1526-5463
DOI: 10.1287/opre.50.4.744.2858